A clonal selection algorithm for urban bus vehicle scheduling
نویسندگان
چکیده
The bus vehicle scheduling problem addresses the task of assigning vehicles to cover the trips in a timetable. In this paper, a clonal selection algorithm based vehicle scheduling approach is proposed to quickly generate satisfactory solutions for large-scale bus scheduling problems. Firstly, a set of vehicle blocks (consecutive trips by one bus) is generated based on the maximal wait time between any two
منابع مشابه
Proposing an approach to calculate headway intervals to improve bus fleet scheduling using a data mining algorithm
The growth of AVL (Automatic Vehicle Location) systems leads to huge amount of data about different parts of bus fleet (buses, stations, passenger, etc.) which is very useful to improve bus fleet efficiency. In addition, by processing fleet and passengers’ historical data it is possible to detect passenger’s behavioral patterns in different parts of the day and to use it in order to improve fle...
متن کاملHybrid Evolutionary Metaheuristics for Concurrent Multi-Objective Design of Urban Road and Public Transit Networks
This paper addresses a bi-modal multi-objective discrete urban road network design problem. The problem includes the simultaneous design of urban road and bus networks in urban areas in which the authorities play a major role in designing bus network topology. The road network design consists of decision making for lane additions to the existing streets, new street constructions, determining th...
متن کاملThe Study of Intelligent Scheduling Algorithm in the Vehicle ECU based on CAN Bus
In this paper, a new intelligent scheduling algorithm, which can improve the network utilization rate, had been present based on analyzing the vehicle CAN bus network schedulability in the vehicle CAN bus electrical control system. Through the mathematical modeling of the vehicle CAN bus network control system, simulation modeling of the 3-loop CAN bus system and computer simulation research ba...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملUrban Transport XX
The urban transport planning process has four basic activities: network design, timetable construction, vehicle scheduling and crew scheduling. In this work we focus on the urban bus timetable construction problem which has two sub-activities: bus frequency calculation and bus departures setting. Typically, these sub-activities are done sequentially, which has some drawbacks: to overcome these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Soft Comput.
دوره 36 شماره
صفحات -
تاریخ انتشار 2015